Register assignment in tree-structured programs
نویسندگان
چکیده
منابع مشابه
Register assignment in tree-structured programs
Much complex decision-making is performed routinely by the software of a computer system. It is appropriate to study more thoroughly the performance of this built-in decisionmaking, because it can strongly influence the efficiency of the entire system. One objective of compilers is to produce a reasonably efficient machine-language version of a user’s program. Traditionally, one of the best opp...
متن کاملAll Structured Programs have Small Tree-Width and Good Register Allocation
The register allocation problem for an imperative program is often modelled as the coloring problem of the interference graph of the control-ow graph of the program. The interference graph of a ow graph G is the intersection graph of some connected subgraphs of G. These connected subgraphs represent the lives, or life times, of variables, so the coloring problem models that two variables with o...
متن کاملStructured Programs have Small Tree-Width and Good Register Allocation (Extended Abstract)
The register allocation problem for an imperative program is often modelled as the coloring problem of the interference graph of the control-ow graph of the program. The interference graph of a ow graph G is the intersection graph of some connected subgraphs of G. These connected subgraphs represent the lives, or life times, of variables, so the coloring problem models that two variables with o...
متن کاملPreference-Guided Register Assignment
This paper deals with coalescing in SSA-based register allocation. Current coalescing techniques all require the interference graph to be built. This is generally considered to be too compile-time intensive for just-in-time compilation. In this paper, we present a biased coloring approach that gives results similar to standalone coalescers while significantly reducing compile time.
متن کاملScheduling tree-structured programs in the LogP model
The LogP model is a model of parallel computation that characterises a parallel computer architecture by four parameters: the latency L, the overhead o, the gap g and the number of processors P . We study the problem of constructing minimum-length schedules for treestructured programs in the LogP model. This problem is proved to be NP-hard, even for outtrees of height two in LogP models with an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Sciences
سال: 1979
ISSN: 0020-0255
DOI: 10.1016/0020-0255(79)90005-7